Planar Graphs Have 1-string Representations
نویسندگان
چکیده
We prove that every planar graph is an intersection graph of strings in the plane such that any two strings intersect at most once.
منابع مشابه
Order-Preserving 1-String Representations of Planar Graphs
This paper considers 1-string representations of planar graphs that are order-preserving in the sense that the order of crossings along the curve representing vertex v is the same as the order of edges in the clockwise order around v in the planar embedding. We show that this does not exist for all planar graphs (not even for all planar 3-trees), but show existence for some subclasses of planar...
متن کامل1-string B1-VPG-representations of planar partial 3-trees and some subclasses
Planar partial 3-trees are subgraphs of those planar graphs obtained by repeatedly inserting a vertex of degree 3 into a face. In this paper, we show that planar partial 3-trees have 1-string B1-VPG representations, i.e., representations where every vertex is represented by an orthogonal curve with at most one bend, every two curves intersect at most once, and intersections of curves correspond...
متن کاملPrimal-Dual Representations of Planar Graphs and L-Contact Representations of Optimal 1-Planar Graphs
We study contact representations of graphs in which vertices are represented by axis-aligned polyhedra in 3D and edges are realized by non-zero area common boundaries between corresponding polyhedra. We show that for every 3-connected planar graph, there exists a simultaneous representation of the graph and its dual with 3D boxes. We give a linear-time algorithm for constructing such a represen...
متن کاملBeyond-Planar Graphs: Algorithmics and Combinatorics
This report summarizes Dagstuhl Seminar 16452 “Beyond-Planar Graphs: Algorithmics and Combinatorics” and documents the talks and discussions. The seminar brought together 29 researchers in the areas of graph theory, combinatorics, computational geometry, and graph drawing. The common interest was in the exploration of structural properties and the development of algorithms for so-called beyond-...
متن کاملContact Representations of Non-Planar Graphs
We study contact representations of non-planar graphs in which vertices are represented by axis-aligned polyhedra in 3D and edges are realized by non-zero area common boundaries between corresponding polyhedra. We present a liner-time algorithm constructing a representation of a 3-connected planar graph, its dual, and the vertex-face incidence graph with 3D boxes. We then investigate contact re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 43 شماره
صفحات -
تاریخ انتشار 2010